Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
نویسندگان
چکیده
منابع مشابه
Seminar on Error Correcting Codes: Unbalanced Expanders from Parvaresh-Vardy Codes
Expanders are graphs that are sparse yet highly connected. The connectivity of the expander is measured by its vertex expansion, which asks that every set S of vertices that is not too large has significantly more than |S| neighbors. Definition. A bipartite (multi)graph with N left-vertices, M right-vertices, and left degree D is specified by a function Γ : [N ]× [D]→ [M ], where Γ(x, y) denote...
متن کاملAlgebraic-geometric generalizations of the Parvaresh-Vardy codes
This paper is concerned with a new family of error-correcting codes based on algebraic curves over finite fields, and list decoding algorithms for them. The basic goal in the subject of list decoding is to construct error-correcting codes C over some alphabet Σ which have good rate R, and at the same every Hamming ball of (relative) radius p has few codewords of C, and moreover these codewords ...
متن کاملLecture 17: Randomness Extractors
This lecture is about randomness extractors. Extractors are functions that map samples from a non-uniform distribution to samples that are close to being uniformly distributed. The length of the output will in general be smaller than the length of the input of the extractor. The input distribution of the extractor is called the source. A source is a random variable which maps text values to bit...
متن کاملRandomness extractors -- applications and constructions
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for constructing extractors, these constructions turn out to have strong pseudorandom properties which found applications in diverse areas of computer science and combinatorics. We will highlight some of the applications, as...
متن کاملRandomness Extractors – An Exposition
Randomness is crucial to computer science, both in theory and applications. In complexity theory, randomness augments computers to offer more powerful models. In cryptography, randomness is essential for seed generation, where the computational model used is generally probabilistic. However, ideal randomness, which is usually assumed to be available in computer science theory and applications, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2009
ISSN: 0004-5411,1557-735X
DOI: 10.1145/1538902.1538904